An optimal partition algorithm for minimization of paging costs
نویسندگان
چکیده
A novel paging scheme under delay bounds is proposed for personal communication systems. This paging scheme is independent of the location probability distributions of the mobile users and satisfies the delay bounds, while minimizing the amount of bandwidth used for locating a mobile user. The proposed paging scheme includes the optimal partition algorithm and paging procedure with respect to paging costs and average delays. The numerical results demonstrate that our proposed scheme is very effective in the minimization of the paging costs for location probability conditions such as uniform and non-uniform distributions.
منابع مشابه
Optimal Capacitor Allocation in Radial Distribution Networks for Annual Costs Minimization Using Hybrid PSO and Sequential Power Loss Index Based Method
In the most recent heuristic methods, the high potential buses for capacitor placement are initially identified and ranked using loss sensitivity factors (LSFs) or power loss index (PLI). These factors or indices help to reduce the search space of the optimization procedure, but they may not always indicate the appropriate placement of capacitors. This paper proposes an efficient approach for t...
متن کاملOptimal Control Pressure for Leakage Minimization in Water Distribution Systems Using Imperialist Competitive Algorithm
One of the key factors affecting leakage in water distribution systems is network pressure management by putting Pressure Reduce Valves (PRV) in the flow path and optimal regulation of these vales in water networks. This study aimed at investigating optimal pressure management problems so as to minimize leakage in water distribution networks. To do so, an approach was proposed for both optimal ...
متن کاملOPTIMAL DESIGN OF NON-PRISMATIC REINFORCED CONCRETE BOX GIRDER BRIDGE: MINIMIZATION OF THE COST AND CO2 EMISSION
This paper presents a computational framework for optimal design of non-prismatic reinforced concrete box girder bridges. The variables include the geometry of the cross section, tapered length, concrete strength and reinforcement of box girders and slabs. These are obtained by the enhanced colliding bodies optimization algorithm to optimizing the cost and again CO2 emission. Loading and design...
متن کاملA Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes
In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کاملEnergy cost minimization in an electric vehicle solar charging station via dynamic programming
Environmental crisis and shortage of fossil fuels make Electric Vehicles (EVs) alternatives for conventional vehicles. With growing numbers of EVs, the coordinated charging is necessary to prevent problems such as large peaks and power losses for grid and to minimize charging costs of EVs for EV owners. Therefore, this paper proposes an optimal charging schedule based on Dynamic Programming (DP...
متن کامل